Slepian-Wolf-Cover theorem for networks of channels

Slepian-Wolf Coding Over Cooperative Relay Networks

This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A Joint source-Wyner-Ziv encoding/sliding window decoding scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered par...

"Real" Slepian-Wolf codes

We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical Slepian-Wolf rate region. For finite alphabets we show that decoding is equivalent to solving an integer program. The techniques used may be of independent interest for code design for a wide class...

Analysis of Slepian Wolf Coding

Polar Codes for Nonasymmetric Slepian-Wolf Coding

A method to construct nonasymmetric distributed source coding (DSC) scheme using polar codes which can achieve any point on the dominant face of the Slepian–Wolf (SW) rate region for sources with uniform marginals is considered. In addition to nonasymmetric case, we also discuss and show explicitly how asymmetric and single source compression is done using successive cancellation (SC) polar dec...

A Generalized Quantum Slepian-Wolf

In this work we consider a quantum generalization of the task considered by Slepian andWolf [1] regarding distributed source compression. In our task Alice, Bob, Charlie and Reference share a joint pure state. Alice and Bob wish to send a part of their respective systems to Charlie without collaborating with each other. We give achievability bounds for this task in the one-shot setting and prov...